Quantum algorithm for solving the test suite minimization problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولRegression Testing: Techniques for Test Suite Minimization
___________________________________________________________________________________________________ Software testing occurs simultaneously during the software development to detect errors as early as possible and to guarantee that changes made in software did not change the system negatively. However, during the development phase, the test suite is efficient and tends to increase in size. Due t...
متن کاملTest Suite Minimization for Testing in Context
In this paper, the problem of test suite minimization for testing in context is studied and some results are proposed. The test architecture considered is general enough to allow the context and the component to have external inputs and outputs. Using a given fault model for testing in context, conditions are provided to detect all the redundant transitions that do not need to be tested. A comp...
متن کاملOn the Application of SAT Solvers to the Test Suite Minimization Problem
The Test Suite Minimization problem in regression testing is a software engineering problem which consists in selecting a set of test cases from a large test suite that satisfies a given condition, like maximizing the coverage and/or minimizing the oracle cost. In this work we use an approach based on SAT solvers to find optimal solutions for the Test Suite Minimization Problem. The approach co...
متن کاملA Tool for Generation and Minimization of Test Suite by Mutant Gene Algorithm
Problem statement: This study proposes a new idea for generation of minimized test suite in the test case generation using the mutant gene algorithm, which not only identifies the best test cases but also reduces the number of test cases generated, selects test cases optimally there improving the performance in testing of software. Test cases are generated by using branch coverage algorithm and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cogent Engineering
سال: 2021
ISSN: 2331-1916
DOI: 10.1080/23311916.2021.1882116